Efficient Heuristics for Single-source Capacitated Multi- Facility Weber Problems
نویسندگان
چکیده
In this paper, a single-source capacitated multifacility location problem with rectilinear distance under unbalanced transportation constraints is studied. The problem is formulated as a mixed integer linear programming problem of which the objective function is the sum of nonlinear functions. An algorithm under decomposition approach combining with logic based techniques is developed. Using this algorithm, the problem is decomposed into two phases, location and allocation phases and then these two are alternately solved using the special properties of rectilinear distance single facility location problem and a branch-and-bound algorithm until no solution improvement is detected. The results of numerical experiments show that the proposed algorithm can solve the problem more efficiently and effectively than the use of direct nonlinear programming tool provided in Matlab.
منابع مشابه
An Efficient Hybrid Metaheuristic for Capacitated p-Median Problem
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...
متن کاملA Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملComparison of Exact Algorithms for Rectilinear Distance Single-Source Capacitated Multi-Facility Weber Problems
Problem statement: The objective of this study is to develop efficient exact algorithms for a single source capacitated multi-facility location problem with rectilinear distance. This problem is concerned with locating m capacitated facilities in the two dimensional plane to satisfy the demand of n customers with minimum total transportation cost which is proportional to the rectilinear distanc...
متن کاملA new GA based solution for capacitated multi source Weber problem
The main purpose of any facility location is to select the optimal places that satisfy project's goals. In location problems, the object is usually to optimize a function objective function that defines the problem conditions and efficient decision parameters. Numerous methods are proposed to challenge the location facility issues. In this paper, we consider a class of location/allocation probl...
متن کاملA Beam Search Heuristic for the Multi- commodity Capacitated Multi-facility Weber Problem
The Multi-Commodity Capacitated Multi-facility Weber Problem (MCMWP) is concerned with locating I capacitated facilities in the plane to satisfy the demand of J customers for K commodities with the minimum total transportation cost. The MCMWP is a non-convex optimization problem. Customer locations, demands and capacities for each commodity are known a priori. The transportation costs, which de...
متن کامل